Hamiltonian properties of generalized pyramids
نویسندگان
چکیده
We investigate here the hamiltonicity and traceability of a class of polytopes generalizing pyramids, prisms, and polytopes with Halin 1-skeleta.
منابع مشابه
An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملSmall k-pyramids and the complexity of determining k
Motivated by the computational complexity of determining whether a graph is hamiltonian, we study under algorithmic aspects a class of polyhedra called k-pyramids, introduced in [Zamfirescu and Zamfirescu, Math. Nachr. 284 (2011) 1739–1747], and discuss related applications. We prove that determining whether a given graph is the 1-skeleton of a k-pyramid, and if so whether it is belted or not, ...
متن کاملA First Step toward Combinatorial Pyramids in n-D Spaces
Combinatorial maps define a general framework which allows to encode any subdivision of an nD orientable quasi-manifold with or without boundaries. Combinatorial pyramids are defined as stacks of successively reduced combinatorial maps. Such pyramids provide a rich framework which allows to encode fine properties of the objects (either shapes or partitions). Combinatorial pyramids have first be...
متن کاملPyramids of n-Dimensional Generalized Maps
Graph pyramids are often used for representing irregular pyramids. Combinatorial pyramids have been recently defined for this purpose. We define here pyramids of n-dimensional generalized maps. This is the main contribution of this work: a generic definition in any dimension which extend and generalize the previous works. Moreover, such pyramids explicitly represent more topological information...
متن کاملConnecing Walks and Connecting Dart Sequences for N-d Combinatorial Pyramids Connecting Walks and Connecting Dart Sequences for N-d Combinatorial Pyramids
Combinatorial maps define a general framework which allows to encode any subdivision of an n-D orientable quasi-manifold with or without boundaries. Combinatorial pyramids are defined as stacks of successively reduced combinatorial maps. Such pyramids provide a rich framework which allows to encode fine properties of objects (either shapes or partitions). Combinatorial pyramids have first been ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011